JaDis: computing distances between nucleic acid sequences
نویسندگان
چکیده
منابع مشابه
JaDis: computing distances between nucleic acid sequences
SUMMARY JaDis is a Java application for computing evolutionary distances between nucleic acid sequences and G+C base frequencies. It allows specific comparison of coding sequences, of non-coding sequences or of a non-coding sequence with coding sequences. AVAILABILITY http://pbil.univ-lyon1.fr/software/jadis.html
متن کاملEstimating Evolutionary Distances between Sequences
These notes accompany a lecture at the summer school on mathematics for bioinformatics, Centre de Recherches Mathematiques, Montreal, August 2003. I develop basic Markov models for sequence evolution and show how these may be used to estimate evolutionary divergences between sequences. I then discuss extensions of the basic model to situations where the evolutionary rate varies over time and fo...
متن کاملComputing distances between partial rankings
We give two efficient algorithms for computing distances between partial rankings (i.e. rankings with ties). Given two partial rankings over n elements, and with b and c equivalence classes, respectively, our first algorithm runs in O(n log n/ log log n) time, and the second in O(n log min{b, c}) time.
متن کاملComputing Distances between Probabilistic Automata
We present relaxed notions of simulation and bisimulation on Probabilistic Automata (PA), that allow some error ε . When ε = 0 we retrieve the usual notions of bisimulation and simulation on PAs. We give logical characterisations of these notions by choosing suitable logics which differ from the elementary ones, L and L ¬, by the modal operator. Using flow networks, we show how to compute the r...
متن کاملComputing Similarity Distances Between Rankings
We address the problem of computing distances between permutations that take into account similarities between elements of the ground set dictated by a graph. The problem may be summarized as follows: Given two permutations and a positive cost function on transpositions that depends on the similarity of the elements involved, find a smallest cost sequence of transpositions that converts one per...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bioinformatics
سال: 1999
ISSN: 1367-4803,1460-2059
DOI: 10.1093/bioinformatics/15.5.424